The quest for strong dualities

The Quest for Strong Inapproximability Results with Perfect Completeness

The Unique Games Conjecture (UGC) has pinned down the approximability of all constraint satisfaction problems (CSPs), showing that a natural semidefinite programming relaxation offers the optimal worst-case approximation ratio for any CSP. This elegant picture, however, does not apply for CSP instances that are perfectly satisfiable, due to the imperfect completeness inherent in the UGC. For th...

Together they are Strong: the Quest for Service Modularization parameters

This research-in-progress paper deals with service modularization of complex services. The successful creation of powerful modules allow leveraging modularization benefits such as reuse, faster development, module-wide innovation, and rapid reconfiguration. Consequently, service provider efficiencies as well as user centricity can be realized. Therefore, the principles of modularization, i.e. c...

the quest for an hiv vaccine

Stable Strong and Total Parametrized Dualities for Dc Optimization Problems in Locally Convex Spaces

By using properties of dualizing parametrization functions, Lagrangian functions and the epigraph technique, some sufficient and necessary conditions of the stable strong duality and strong total duality for a class of DC optimization problems are established.

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...